A graph-theoretical approach to solving Scramble Squares puzzles
نویسندگان
چکیده
منابع مشابه
A probabilistic approach to solving crossword puzzles
We attacked the problem of solving crossword puzzles by computer: given a set of clues and a crossword grid, try to maximize the number of words correctly filled in. After an analysis of a large collection of puzzles, we decided to use an open architecture in which independent programs specialize in solving specific types of clues, drawing on ideas from information retrieval, database search, a...
متن کاملSolving tangram puzzles: A connectionist approach
We present a connectionist approach for solving Tangram puzzles. Tangram is an ancient Chinese puzzle where the object is to decompose a given figure into seven basic geometric figures. One connectionist approach models Tangram pieces and their possible placements and orientations as connectionist neuron units which receive excitatory connections from input units defining the puzzle and lateral...
متن کاملA graph theoretical approach to data fusion.
The rapid development of high throughput experimental techniques has resulted in a growing diversity of genomic datasets being produced and requiring analysis. Therefore, it is increasingly being recognized that we can gain deeper understanding about underlying biology by combining the insights obtained from multiple, diverse datasets. Thus we propose a novel scalable computational approach to ...
متن کاملA Least Squares Approach to Estimating the Average Reservoir Pressure
Least squares method (LSM) is an accurate and rapid method for solving some analytical and numerical problems. This method can be used to estimate the average reservoir pressure in well test analysis. In fact, it may be employed to estimate parameters such as permeability (k) and pore volume (Vp). Regarding this point, buildup, drawdown, late transient test data, modified Muskat method, interfe...
متن کاملA Global Approach for Solving Edge-Matching Puzzles
We consider apictorial edge-matching puzzles, in which the goal is to arrange a collection of puzzle pieces with colored edges so that the colors match along the edges of adjacent pieces. We devise an algebraic representation for this problem and provide conditions under which it exactly characterizes a puzzle. Using the new representation, we recast the combinatorial, discrete problem of solvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Involve, a Journal of Mathematics
سال: 2012
ISSN: 1944-4184,1944-4176
DOI: 10.2140/involve.2012.5.313